Cover Array String Reconstruction
نویسندگان
چکیده
A proper factor u of a string y is a cover of y if every letter of y is within some occurrence of u in y. The concept generalises the notion of periods of a string. An integer array C is the minimal-cover (resp. maximal-cover) array of y if C [i] is the minimal (resp. maximal) length of covers of y[0 . . i], or zero if no cover exists. In this paper, we present a constructive algorithm checking the validity of an array as a minimal-cover or maximal-cover array of some string. When the array is valid, the algorithm produces a string over an unbounded alphabet whose cover array is the input array. All algorithms run in linear time due to an interesting combinatorial property of cover arrays: the sum of important values in a cover array is bounded by twice the length of the string.
منابع مشابه
Degenerate String Reconstruction from Cover Arrays
Regularities in degenerate strings have recently been a matter of interest because of their use in the fields of molecular biology, musical text analysis, cryptanalysis and so on. In this paper, we study the problem of reconstructing a degenerate string from a cover array. We present two efficient algorithms to reconstruct a degenerate string from a valid cover array one using an unbounded alph...
متن کامل[hal-00742061, v1] Efficient Seeds Computation Revisited
The notion of the cover is a generalization of a period of a string, and there are linear time algorithms for finding the shortest cover. The seed is a more complicated generalization of periodicity, it is a cover of a superstring of a given string, and the shortest seed problem is of much higher algorithmic difficulty. The problem is not well understood, no linear time algorithm is known. In t...
متن کاملEfficient Seeds Computation Revisited
The notion of the cover is a generalization of a period of a string, and there are linear time algorithms for finding the shortest cover. The seed is a more complicated generalization of periodicity, it is a cover of a superstring of a given string, and the shortest seed problem is of much higher algorithmic difficulty. The problem is not well understood, no linear time algorithm is known. In t...
متن کاملNew and Efficient Approaches to the Quasiperiodic Characterisation of a String
A factor u of a string y is a cover of y if every letter of y lies within some occurrence of u in y; thus every cover u is also a border – both prefix and suffix – of y. A string y covered by u thus generalises the idea of a repetition; that is, a string composed of exact concatenations of u. Even though a string is coverable somewhat more frequently than it is a repetition, still a string that...
متن کاملLinear Time Inference of Strings from Cover Arrays Using a Binary Alphabet - (Extended Abstract)
Covers being one of the most popular form of regularities in strings, have drawn much attention over time. In this paper, we focus on the problem of linear time inference of strings from cover arrays using the least sized alphabet possible. We present an algorithm that can reconstruct a string x over a two-letter alphabet whenever a valid cover array C is given as an input. This algorithm uses ...
متن کامل